A Hierarchy of Temporal Logics with Past (Extended Abstract)

نویسندگان

  • François Laroussinie
  • Philippe Schnoebelen
چکیده

We extend the classical hierarchy of branching-time temporal logics between UB and CTL by studying which additional expressive power (if any) stems from the incorporation of past-time modalities. In addition, we propose a new temporal combinator, N for \Now", that brings new and interesting expressive power. In several situations, non-trivial translation algorithms exist from a temporal logic with past to a pure-future fragment. These algorithms have important practical applications e.g. in the eld of model-checking.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing Expressive Power of Timed Logics BTP report

Timed temporal logics encompass a huge diversity of operators, as a result of which, the decidability and expressiveness properties vary considerably. Both pointwise and continuous interpretations of temporal logics can be defined (over finite words), and properties vary based on the interpretation too. The EhrenfeuchtFräıssé games (EF games) for Linear Temporal Logic, as defined by Etessami-Wi...

متن کامل

Quantified CTL : expressiveness and model checking ( Extended abstract ) Arnaud

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...

متن کامل

A Hierarchy of Temporal Logics with Past

We extend the classical hierarchy of branching-time temporal logics between UB and CTL* by studying which additional expressive power (if any) stems from the incorporation of past-time modalities. In addition, we propose a new temporal combinator, N for " From Now On " , that brings new and interesting expressive power. In several situations, nontrivial translation algorithms exist from a tempo...

متن کامل

Metric Temporal Description Logics with Interval-Rigid Names (Extended Abstract)

In contrast to qualitative linear temporal logics, which can be used to state that some property will eventually be satisfied, metric temporal logics allow to formulate constraints on how long it may take until the property is satisfied. While most of the work on combining Description Logics (DLs) with temporal logics has concentrated on qualitative temporal logics, there has recently been a gr...

متن کامل

Assertional logics, truth-equational logics, and the hierarchies of abstract algebraic logic

We establish some relations between the class of truth-equational logics, the class of assertional logics, other classes in the Leibniz hierarchy, and the classes in the Frege hierarchy. We argue that the class of assertional logics belongs properly in the Leibniz hierarchy. We give two new characterizations of truth-equational logics in terms of their full generalized models, and use them to o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994